Binding number and toughness for matching extension

Toughness and binding number

Let τ(G) and bind(G) be the toughness and binding number, respectively, of a graph G. Woodall observed in 1973 that τ(G) > bind(G) − 1. In this paper we obtain best possible improvements of this inequality except when (1+ √ 5)/2 < bind(G) < 2 and bind(G) has even denominator when expressed in lowest terms.

Toughness and matching extension in graphs

ON THE MATCHING NUMBER OF AN UNCERTAIN GRAPH

Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...

Toughness and edge-toughness

Matching Objects Without Language Extension

Pattern matching is a powerful programming concept which has proven its merits in declarative programming. The absence of pattern-matching in object-oriented programming languages is felt especially when tackling source code processing problems. But existing proposals for pattern matching in such languages rely on language extension, which makes their adoption overly intrusive. We propose an ap...